Two improvements of the iterative method for computing Moore-Penrose inverse based on Penrose equations
نویسندگان
چکیده
An iterative algorithm for estimating the Moore-Penrose generalized inverse is developed. The main motive for the construction of algorithm is simultaneous usage of Penrose equations (2) and (4). Convergence properties of the introduced method are considered as well as their first-order and the second-order error terms. Numerical experience is also presented. AMS Subj. Class.: 15A09.
منابع مشابه
An Efficient Schulz-type Method to Compute the Moore-Penrose Inverse
A new Schulz-type method to compute the Moore-Penrose inverse of a matrix is proposed. Every iteration of the method involves four matrix multiplications. It is proved that this method converge with fourth-order. A wide set of numerical comparisons shows that the average number of matrix multiplications and the average CPU time of our method are considerably less than those of other methods.
متن کاملHermitian solutions to the system of operator equations T_iX=U_i.
In this article we consider the system of operator equations T_iX=U_i for i=1,2,...,n and give necessary and suffcient conditions for the existence of common Hermitian solutions to this system of operator equations for arbitrary operators without the closedness condition. Also we study the Moore-penrose inverse of a ncross 1 block operator matrix and. then gi...
متن کاملThe reverse order law for Moore-Penrose inverses of operators on Hilbert C*-modules
Suppose $T$ and $S$ are Moore-Penrose invertible operators betweenHilbert C*-module. Some necessary and sufficient conditions are given for thereverse order law $(TS)^{ dag} =S^{ dag} T^{ dag}$ to hold.In particular, we show that the equality holds if and only if $Ran(T^{*}TS) subseteq Ran(S)$ and $Ran(SS^{*}T^{*}) subseteq Ran(T^{*}),$ which was studied first by Greville [{it SIAM Rev. 8 (1966...
متن کاملUniversal Iterative Methods for Computing Generalized Inverses
In this paper we construct a few iterative processes for computing {1, 2} inverses of a linear bounded operator, based on the hyper-power iterative method or the Neumann-type expansion. Under the suitable conditions these methods converge to the {1, 2, 3} or {1, 2, 4} inverses. Also, we specify conditions when the iterative processes converge to the Moore-Penrose inverse, the weighted Moore-Pen...
متن کاملAn accelerated iterative method for computing weighted Moore-Penrose inverse
The goal of this paper is to present an accelerated iterative method for computing weighted Moore–Penrose inverse. Analysis of convergence is included to show that the proposed scheme has sixth-order convergence. Using a proper initial matrix, a sequence of iterates will be produced, which is convergent to the weighted Moore–Penrose inverse. Numerical experiments are reported to show the effici...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Computational Applied Mathematics
دوره 267 شماره
صفحات -
تاریخ انتشار 2011